home *** CD-ROM | disk | FTP | other *** search
- From weiner@pts.mot.com Thu Mar 18 17:00 MST 1993
- Received: from motgate.mot.com by maine.et.byu.edu; Thu, 18 Mar 93 17:00:13 -0700
- Return-Path: <weiner@pts.mot.com>
- Received: from pobox.mot.com ([129.188.137.100]) by motgate.mot.com with SMTP (5.65c/IDA-1.4.4/MOT-2.13 for <yackd@maine.et.byu.edu>)
- id AA23402; Thu, 18 Mar 1993 17:57:16 -0600
- Received: from pts.mot.com ([145.4.3.2]) by pobox.mot.com with SMTP (5.65c/IDA-1.4.4/MOT-2.12 for <yackd@maine.et.byu.edu>)
- id AA13790; Thu, 18 Mar 1993 17:57:51 -0600
- Received: from info. ([145.4.25.12]) by pts.mot.com (4.1/SMI-4.1)
- id AA18452; Thu, 18 Mar 93 18:53:25 EST
- Received: by info. (NX5.67c/NX3.0S)
- id AA02300; Thu, 18 Mar 93 19:01:39 -0500
- Date: Thu, 18 Mar 93 19:01:39 -0500
- From: Bob Weiner <weiner@pts.mot.com>
- Message-Id: <9303190001.AA02300@info.>
- To: yackd@maine.et.byu.edu
- In-Reply-To: Don Yacktman's message of Thu, 18 Mar 93 16:34:14 -0700 <9303182334.AA29304@maine.et.byu.edu>
- Subject: Re: Anyone have a tree display class that can read a tree from a text file?
- Status: R
-
-
- > X-Delivered: at request of weiner on infocomm
- > Date: Thu, 18 Mar 93 16:34:14 -0700
- > From: yackd@maine.et.byu.edu (Don Yacktman)
- >
- > > I guess if would be easy to write if I knew how to draw lines between buttons
- > > (nodes) to connect them but this will be my first NeXTSTEP program and I
- > > don't know how to do anything with DPS yet.
- >
- > > Also, if it is so easy to do, it is surprising that no one else has an object
- > > to do this.
- >
- > Good point...I think it would be easy though, so if you tell me what you
- > want, I bet I could whip something up quick and then put it on the net
- > as a GNU copylefted thing...
-
- Great. Here's what I would want. The tree class could read in a tree from
- a file in textual form. The first line is the name of the tree.
- In textual form, each node in the tree is given by its label, which can be
- any text, including spaces on a single line. The node's position in the tree
- is given by its preceding indentation, normally using 3 spaces of indentation
- per level (the amount can be figured out by examining the first indented
- label and counting its spaces. An example:
-
- Tree Name
- Root
- Node 1
- Node 1.1
- Node 1.1.1
- Node 2 has this longer label.
-
-
- After the tree is read in, it is displayed within a new view. Each node is
- created as a selectable button with the appropriate label and lines
- connecting it to its parent and children. (Let's assume only one button can
- be selected at a time.)
-
- When a button is selected, a string consisting of the tree name and the node
- selected is sent to an output stream. (stdout is fine as a default.), e.g.
-
- Tree Name^^Node 1.1
-
- could be output with ^^ indicating separation of the two arguments.
-
- That's it. Then my other program takes this standard output and displays
- text associated with the selected node.
-
-
-